In this presentation, we consider the Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) in which the delivery to a customer can be split between any number of vehicles. This problem has not been extensively studied in the literature. The main contribution of this paper is a Branch and Price approach for solving the SDVRPTW without imposing restrictions on the split delivery opt...

The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, distribution centers strive for competitive efficiency operations minimize transportation costs. This study proposed mixed-integer programming (MIP) model multi-depot split-delivery vehicle routing problems (MDSDVRPs) with ...

Splitting loads such that the delivery of certain loads is completed in multiple trips rather than one trip results in opportunities for a reduction in cost and the number of vehicles used. Several studies have shown the benefit of split deliveries for the Vehicle Routing Problem, in which a vehicle operating out of a depot makes a series of deliveries on each route. In this paper, we quantify ...

In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each rou...

We consider an extension o f the Split Delivery Vehicle R outing Problem , whereby custom ers may have a tim e window on their delivery. A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with T im e W indow s. T w o im provem ent heuristics are also given: one attem pts to m ove custom ers between routes, while the othe...